#region Using Directives and Copyright Notice

// Copyright (c) 2007-2010, Computer Consultancy Pty Ltd
// All rights reserved.
// 
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright
//       notice, this list of conditions and the following disclaimer in the
//       documentation and/or other materials provided with the distribution.
//     * Neither the name of the Computer Consultancy Pty Ltd nor the
//       names of its contributors may be used to endorse or promote products
//       derived from this software without specific prior written permission.
// 
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
// ARE DISCLAIMED. IN NO EVENT SHALL COMPUTER CONSULTANCY PTY LTD BE LIABLE 
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.

using System;
using System.Collections;
using System.Diagnostics;

#endregion

namespace Interlace.Geo
{
	public class Journey
	{
		ArrayList _segments = new ArrayList();
		Polyline _input;
	
		public Journey(Polyline line, double threshold)
		{
			_input = line;
			DouglasPeucker.Simplify(line, threshold, 
			  new DouglasPeucker.HandleSegment(HandleSegment));
		}
		
		public IEnumerator GetEnumerator()
		{
			return _segments.GetEnumerator();
		}
		
		public void HandleSegment(int i, int j)
		{
			Debug.Assert(i < j);
		
			JourneySegment last_segment = null;
			if (_segments.Count > 0) {
				last_segment = (JourneySegment)_segments[_segments.Count - 1];
			}
			
			JourneySegment new_segment = new JourneySegment();
			new_segment.Line = _input.SubString(i, j);
			
			// Attach the segment to the neighbours list:
			if (last_segment != null) last_segment.Next = new_segment;
			new_segment.Previous = last_segment;
			last_segment = new_segment;
			
			_segments.Add(new_segment);
		}		
	}
}
